Simple Groups in Computational Group Theory
نویسنده
چکیده
Thisnotedescrib esrecen tresearc h usingstructural propertiesofflnitegroupstodevise–cien talgorithms forgroupcomputation. 1991Mathematics SubjectClassiflcation: 20B40,20D05,68Q40 KeywordsandPhrases: grouptheoretic algorithms, implegroups
منابع مشابه
Enumeration of Conformers of Octahedral [M(ABC)_{6}] Complex on the Basis of Computational Group Theory
Conformers of [M(ABC)6] complex have been enumerated on the basis of computational group theory, where M is the central metal, and ABC is the ligand, bound to M through A. Based on the 16 conformers of the M(AB)6 core unit, 7173 conformers have been found for the [M(ABC)6] complex, which are assigned to nine point groups, 1 D3d, 4 D3, 4 S6, 5 C2h, 7 C3, 182 C2, 15 Cs, 23 Ci, and 6932 C1.
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملOn the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers
There is much interest in finding short presentations for the finite simple groups. In a previous paper we produced nice efficient presentations for all small simple groups and for their covering groups. Here we extend those results from simple group order less than 100,000 up to order one million, but we leave one simple group and one covering group for which the efficiency question remains un...
متن کاملInvolution centralizers in matrix group algorithms
Introduction In this talk all groups are finite (by definition), and all simple groups are non-abelian. Let us first define our terms: an involution in a group G is an element t of order 2, i.e. t = 1 and t 6= 1. Its centralizer CG(t) is the subgroup of elements which commute with it, so CG(t) = {g ∈ G | tg = gt}. It has long been accepted in abstract group theory that the way to study simple g...
متن کاملComputational Complexity in Finite Groups
We survey recent results on the asymptotic complexity of some of the fundamental computational tasks in finite groups in a variety of computational models. A striking recent feature is that techniques motivated by the problems of the more abstract models (nondeterminism, extreme parallelization) have turned out to provide powerful tools in the design of surprisingly efficient algorithms on real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998